Crate pathfinding [−] [src]
This crate implements functions to search in a graph.
It supports the following Cargo features:
edmondskarp: include the Edmonds-Karp algorithm variants (default: true)kuhnmunkres: include the Kuhn-Munkres algorithm (default: true)
Reexports
pub extern crate ndarray; |
pub extern crate num_traits; |
Functions
| astar |
Compute a shortest path using the A* search algorithm. |
| bfs |
Compute a shortest path using the breadth-first search algorithm. |
| dfs |
Compute a path using the depth-first search algorithm. |
| dijkstra |
Compute a shortest path using the Dijsktra search algorithm. |
| edmondskarp |
Compute the maximum flow that can go through a directed graph using the Edmonds Karp algorithm. |
| edmondskarp_matrix |
Compute the maximum flow that can go through a directed graph using the Edmonds Karp algorithm. The graph is described via an adjacency matrix. |
| fringe |
Compute a shortest path using the Fringe search algorithm. |
| idastar |
Compute a shortest path using the IDA* search algorithm. |
| kuhn_munkres |
Compute the maximum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm). |
| kuhn_munkres_min |
Compute the minimum matching between two disjoints sets of vertices using the Kuhn-Munkres algorithm (also known as Hungarian algorithm). |